8 Conclusion
نویسندگان
چکیده
UNIFY is a new scheme for maintaining consistency between aggregated and disaggregated levels. It does away with explicit switching between aggregated and disaggregated states, and instead, maintains all state information for all levels. Units can comply with interactions at different levels. Perceivers are responsible for demanding information they need. We solve the temporal consistency problem by requiring atomic entity interactions. We resolve chain disaggregations because disaggregation is non-existent. We alleviate network flooding by causing fewer entities to be created and making message aggregation simpler. Also, we provide the mechanisms for aggregations of dissimilar entities and dynamic aggregations. UNIFY requires more memory and CPU cycles, but reduces network traffic. It is not clear how computation of complex Lanchester equations will match speeds at which virtual entities perform interactions, and we recommend research in this area. Existing simulations may not be able to support UNIFY, but this may be an advantageous way to design new aggregate-level simulations. We intend implementing UNIFY to give a proof-of-concept.
منابع مشابه
DBNS Filter
.......................................................................................................................................... 3 Project Proposal ............................................................................................................................. 4 The application...................................................................................................
متن کاملEarly phrasing patterns in Catalan and Spanish multi-word speech
3 Introduction 3 Stress 6 Pause 6 Intonational contour 6 Method 8 Participants 8 Materials 8 Data analysis 9 Syntactic labeling 9 Identical words and SSWU 10 Prosodic labeling 11 Results 14 Intonational contour 14 Pauses 15 Syntactic categories 16 Conclusion 19 References 22
متن کاملAlgorithms and scheduling techniques for clusters and grids
ing the Lyon platform. [email protected] February 8, 2008 Algorithms and scheduling techniques 65/ 134 Introduction Parallel algorithms Scheduling Pipeline workflows Models and real life Conclusion Results First heuristic building the ring without taking link sharing into account Second heuristic taking link sharing into account (and with quadratic programming) Ratio Dc/Dw H1 H2 Gain 0.64...
متن کاملIntroduction: National Security and Intelligence Integration
Introduction................................................................................................................................. 1 Integration – The Need and the Opportunity .............................................................................. 1 Overcoming Impediments to Integration .................................................................................... 7 Secu...
متن کاملCse 145/237d Final Report
............................................................................................ 2 Background ........................................................................................ 2 Implementation ................................................................................. 4 Development setup ......................................................................................
متن کاملThird Party Risk Management
.................................................................................................................................3 Introduction...........................................................................................................................3 Background/Historical Analysis.............................................................................................3 Thir...
متن کامل